Feature Correspondence: A Markov Chain Monte Carlo Approach
نویسندگان
چکیده
When trying to recover 3D structure from a set of images, the most di cult problem is establishing the correspondence between the measurements. Most existing approaches assume that features can be tracked across frames, whereas methods that exploit rigidity constraints to facilitate matching do so only under restricted camera motion. In this paper we propose a Bayesian approach that avoids the brittleness associated with singling out one \best" correspondence, and instead consider the distribution over all possible correspondences. We treat both a fully Bayesian approach that yields a posterior distribution, and a MAP approach that makes use of EM to maximize this posterior. We show how Markov chain Monte Carlo methods can be used to implement these techniques in practice, and present experimental results on real data.
منابع مشابه
Addressing the Correspondence Problem: A Markov Chain Monte Carlo Approach
Many vision and AI techniques assume that some form of the infamous correspondence problem has been solved. Typically, a best mapping between sets of features is found either as a pre-processing step or as a side-effect of applying the technique. In this paper we argue that it is incorrect to insist on a single ’best’ mapping between features in order to estimate a property that depends on this...
متن کاملSpatial count models on the number of unhealthy days in Tehran
Spatial count data is usually found in most sciences such as environmental science, meteorology, geology and medicine. Spatial generalized linear models based on poisson (poisson-lognormal spatial model) and binomial (binomial-logitnormal spatial model) distributions are often used to analyze discrete count data in which spatial correlation is observed. The likelihood function of these models i...
متن کاملFeature Selection by Markov Chain Monte Carlo Sampling - A Bayesian Approach
We redefine the problem of feature selection as one of model selection and propose to use a Markov Chain Monte Carlo method to sample models. The applicability of our method is related to Bayesian network classifiers. Simulation experiments indicate that our novel proposal distribution results in an ignorant proposal prior. Finally, it is shown how the sampling can be controlled by a regulariza...
متن کامل